Generating all 3-connected 4-regular planar graphs from the octahedron graph
نویسندگان
چکیده
منابع مشابه
Generating all 3-connected 4-regular planar graphs from the octahedron graph
We prove that all 3-connected 4-regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all connected 4-regular planar graphs from the
متن کاملGenerating 5-regular planar graphs
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. ∗Research partially supported by NSF grants DMS-0556091 and ITR-0326387. †Research partially supported by Board of Regents grant LEQSF(2004-07)-RD-A-22.
متن کاملGenerating 4-connected graphs
5 Let C = {C n : n ≥ 5} and let L = {G : G is the line graph of an internally 4-connected cubic graph}. 6 A classical result of Martinov states that every 4-connected graph G can be constructed from graphs in 7 C ∪L by repeatedly splitting vertices. In this paper we prove that, in fact, G can be constructed from C 5 8 or C 6 in the same way, unless G belongs to C ∪L. Moreover, if G is nonplanar...
متن کاملCycles in 4-connected planar graphs
Let G be a 4-connected planar graph on n vertices. Previous results show that G contains a cycle of length k for each k ∈ {n, n − 1, n − 2, n − 3} with k ≥ 3. These results are proved using the “Tutte path” technique, and this technique alone cannot be used to obtain further results in this direction. One approach to obtain further results is to combine Tutte paths and contractible edges. In th...
متن کامل4-Connected Projective-Planar Graphs Are Hamiltonian
We prove the result stated in the title (conjectured by Grünbaum), and a conjecture of Plummer that every graph which can be obtained from a 4–connected planar graph by deleting two vertices is Hamiltonian. The proofs are constructive and give rise to polynomial–time algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1993
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.3190170508